Fluid Limits for Bandwidth-Sharing Networks with Rate Constraints
نویسندگان
چکیده
منابع مشابه
Fluid Limits for Bandwidth-Sharing Networks with Rate Constraints
Bandwidth-sharing networks as introduced by Massoulié & Roberts (1998) model the dynamic interaction among an evolving population of elastic flows competing for several links. With policies based on optimization procedures, such models are of interest both from a Queueing Theory and Operations Research perspective. In the present paper, we focus on bandwidth-sharing networks with capacities and...
متن کاملLimit Theorems for Markovian Bandwidth-Sharing Networks with Rate Constraints
• A submitted manuscript is the author's version of the article upon submission and before peer-review. There can be important differences between the submitted version and the official published version of record. People interested in the research are advised to contact the author for the final version of the publication, or visit the DOI to the publisher's website. • The final author version ...
متن کاملOn Adaptive Bandwidth Sharing with Rate Guarantees
The objective of recent research in fair queueing schemes has been to efficiently emulate a fluid-flow generalized (weighted) processor sharing (GPS) system, as closely as possible. A primary motivation for the use of fair-queueing has been its use as a means of providing bandwidth guarantees and as a consequence end-to-end delay bounds for traffic with bounded burstiness. The rate guarantees t...
متن کاملBandwidth sharing networks with priority scaling
Abstract: In multi-class communication networks, traffic surges due to one class of users can significantly degrade the performance for other classes. During these transient periods, it is thus of crucial importance to implement priority mechanisms that conserve the quality of service experienced by the affected classes, while ensuring that the temporarily unstable class is not entirely neglect...
متن کاملFluid Limits for Processor-Sharing Queues with Impatience
We investigate a processor-sharing queue with renewal arrivals and generally distributed service times. Impatient jobs may abandon the queue or renege before completing service. The random time representing a job’s patience has a general distribution and may be dependent on its initial service time requirement. A scaling procedure that gives rise to a fluid model with nontrivial yet tractable s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Operations Research
سال: 2014
ISSN: 0364-765X,1526-5471
DOI: 10.1287/moor.2013.0641